منابع مشابه
Many-to-many disjoint paths in hypercubes with faulty vertices
This paper considers the problemofmany-to-many disjoint paths in the hypercubeQn with f faulty vertices and obtains the following result. For any integer k with 1 ≤ k ≤ n − 1 and any two sets S and T of k fault-free vertices in different partite sets of Qn (n ≥ 2), if f ≤ 2n−2k−2 and each fault-free vertex has at least two fault-free neighbors, then there exist k fully disjoint fault-free paths...
متن کاملEngineering Time-Dependent Many-to-Many Shortest Paths Computation
Computing distance tables is important for many logistics problems like the vehicle routing problem (VRP). While shortest distances from all source nodes in S to all target nodes in T are time-independent, travel times are not. We present the first efficient algorithms to compute time-dependent travel time tables in large time-dependent road networks. Our algorithms are based on time-dependent ...
متن کاملEfficient Computation of Many-to-Many Shortest Paths
Considering large road networks, we are interested in finding all quickest connections between given source and target locations. The computation of such a distance table is what we call the many-to-many shortest path problem. For several problems in the field of logistics this is an important subtask. For example it is required as an input for vehicle routing problems. Also, distance tables ar...
متن کاملComputing Many-to-Many Shortest Paths Using Highway Hierarchies
We present a fast algorithm for computing all shortest paths between source nodes s ∈ S and target nodes t ∈ T . This problem is important as an initial step for many operations research problems (e.g., the vehicle routing problem), which require the distances between S and T as input. Our approach is based on highway hierarchies, which are also used for the currently fastest speedup techniques...
متن کاملEnergetics and behavior: many paths to understanding.
In a recent Opinion, Mathot and Dingemanse [1] draw attention to a claimed major assumption of studies linking animal personality and energetics: ‘that the selected measure of [metabolism] is a valid proxy for energetic constraints.’ They argue that unless this assumption is tested, results from many studies are uninterpretable. We would like to argue that the definition of energetic constraint...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2000
ISSN: 0028-0836,1476-4687
DOI: 10.1038/35013162